Scheduling to maximize customer satisfaction: A project for the shad valley program
نویسندگان
چکیده
منابع مشابه
Scheduling To Maximize Customer Satisfaction: A Project for the Shad Valley Program E. W. Richards and J. Bhadury E. Richards and J. Bhadury (1996). Scheduling To Maximize Customer Satisfaction: A Project for the Shad
This paper describes a project that was done for the Shad Valley Program, where it was required to assign students to seminars so as to maximize the satisfaction of the students with their assignments. We begin by describing the problem, its inputs and constraints. Two models are proposed to determine optimal assignments. The first model is based on the Capacitated Transportation Problem and a ...
متن کامل“investigating the relationship between knowledge management and customer satisfaction considering to the e-services”
چکیده : این مطالعه تاثیر مدیریت دانش بر رضایتمندی مشتریان با توجه به خدمات الکترونیک در سازمان حمل و نقل و پایانه های استان سیستان و بلوچستان را مورد بررسی قرار می دهد. جامعه آماری این تحقیق مدیران، سرپرستان و کارشناسان مشغول به کار در سازمان حمل و نقل و پایانه های استان سیستان و بلوچستان بوده که مجموعا 94 نفر می باشند. برای تعیین حداقل نمونه از جدول مورگان استفاده شده است. که با توجه به جدول ...
Setting Due Dates and Scheduling Jobs to Maximize Customer Satisfaction and Profits
Dynamic job shop scheduling research has previously assumed that the probability of the customer placing an order is always one, implying that customers will place orders regardless of lead times quoted from the producer and customer lead time expectations. As firms increasingly compete on the basis of the delivery speed and reputation, the relative performance of quoted versus actual realized ...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 1996
ISSN: 0360-8352
DOI: 10.1016/0360-8352(95)00185-9